Efficiently Decoding Reed–Muller Codes From Random Errors
نویسندگان
چکیده
منابع مشابه
Efficient decoding of random errors for quantum expander codes
We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Zémor can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a linear number of random errors with...
متن کاملDecoding high rate Reed-Muller codes from random errors in near linear time
Reed-Muller codes encode an m-variate polynomial of degree k by evaluating it on all points in {0, 1}. We denote this code with RM(m, k). For k = m − r, its distance is 2 and so it cannot correct more than 2r−1 errors in the worst case. For random errors one may hope for a better result. Shannon (Bell System Technical Journal, 1948) proved that for codes of the same rate, one cannot correct mor...
متن کاملErrors-and-erasures Decoding of Bch Codes
We give a Grr obner basis algorithm for errors-and-erasures decoding of BCH codes that avoids computation of the modiied syndrome polynomial. The decoding problem is viewed as an instance of a more general interpolation problem. Our algorithm has the same computational complexity as the Berlekamp{Massey algorithm but is more eecient in hardware.
متن کاملlinear codes on solid bursts and random errors
the paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length $b$ or less and simultaneously any $e$ or less random errors. an example of such a code is also provided. further, codes capable of detecting and simultaneously correcting such errors have also been dealt with.
متن کاملLimits to List Decoding Random Codes
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy function) with high probability is a (ρ, 1/ε)-list decodable code. (That is, every Hamming ball of radius at most ρn has at most 1/ε codewords in it.) In this paper we prove the “converse” result. In particular, we prove that for every 0 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2671410